Computational Properties of Epistemic Logic Programs
نویسنده
چکیده
Gelfond’s epistemic logic programs are not only an extension of disjunctive extended logic programs for handling difficulties in reasoning with incomplete information, but also an effective formalism to represent agents’ epistemic reasoning under a logic programming setting. Recently there is an increasing research in this direction. However, for many years the complexity of epistemic logic programs remains unclear. This paper provides a precise answer to this problem. We prove that consistency check for epistemic logic programs is in PSPACE and this upper bound is also tight. The approach developed in our proof is of interest on its own: it immediately yields an algorithm to compute world views of an epistemic logic program, and it can also be used to study computational properties of nested epistemic logic programs a significant generalization of Gelfond’s formalism.
منابع مشابه
Epistemic Reasoning in Logic Programs
Although epistemic logic programming has an enhanced capacity to handle complex incomplete information reasoning and represent agents’ epistemic behaviours, it embeds a significantly higher computational complexity than non-disjunctive and disjunctive answer set programming. In this paper, we investigate some important properties of epistemic logic programs. In particular, we show that Lee and ...
متن کاملConcurrent information update in multi-agent systems: from Hintikka to Abramsky Games
Abramsky and Hintikka style games can be seen as representatives of the two main branches of game semantics. They both model interaction but each in a different manner. Hintikka games provide models of propositional interaction in terms of classical logic connectives such as ∨, ∧, →, and ¬. Abramsky games, on the other hand, model the interaction between programs that run in different parallel ...
متن کاملPlanning Using Dynamic Epistemic Logic: Correspondence and Complexity
A growing community investigates planning using dynamic epistemic logic. Another framework based on similar ideas is knowledgebased programs as plans. Here we show how actions correspond in the two frameworks. We finally discuss fragments of DEL planning obtained by the restriction of event models. Fragments are separated by virtue of their computational complexity.
متن کاملUpdating Epistemic Logic Programs
We consider the problem of updating nonmonotonic knowledge bases represented by epistemic logic programs where disjunctive information and notions of knowledge and belief can be explicitly expressed. We propose a formulation for epistemic logic program update based on a principle called minimal change and maximal coherence. The central feature of our approach is that during an update or a seque...
متن کاملNested Epistemic Logic Programs
Nested logic programs and epistemic logic programs are two important extensions of answer set programming. However, the relationship between these two formalisms is rarely explored. In this paper we first introduce the epistemic HT-logic, and then propose a more general extension of logic programs called nested epistemic logic programs. The semantics of this extension named equilibrium views is...
متن کامل